Towards Parametric Causal Semantics in pi-calculus
نویسندگان
چکیده
In a concurrent setting, causally-consistent reversibility relates causality and reversibility. In this note we overview three causal semantics for π-calculus: two classical and a recent one used for a reversible variant of π-calculus. We show the differences between them via examples, and discuss how to revise the classical one in order to be used as the underlying machinery for a reversible calculus. We propose a reinterpretation of such notions in particular when it comes to silent actions and names extrusion. Our ultimate goal is to devise a general reversible framework parametric into the underlying notion of causality.
منابع مشابه
A Decidable Characterization of a Graphical Pi-calculus with Iterators
This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics of Pi-graphs use ground notions of labelled transition and bisimulation, which means standard verification techniques can be applied. We show that bisimilar...
متن کاملA Chart Semantics for the Pi-Calculus
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational semantics. A pi-chart is a finite directed acyclic graph recording a computation in the pi-calculus. Each node represents a process, and each edge either represents a computation step, or a message-passing interaction. P...
متن کاملStéphanie Delaune , Steve Kremer and Mark D . Ryan Symbolic bisimulation for the applied pi calculus Research Report LSV - 07 - 14 April 2007
We propose a symbolic semantics for the finite applied pi calculus, which is a variant of the pi calculus with extensions for modelling cryptgraphic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs from the environment. Correctness is maintained by associating with each process a set of constraints on symbolic terms...
متن کاملSymbolic bisimulation for the applied pi calculus ( extended abstract ) ⋆
Recently, we have proposed in [10] a symbolic semantics together with a sound symbolic labelled bisimulation relation for the finite applied pi calculus. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs from the environment. This work is an important step towards automation of observational equivalence for the finite applied p...
متن کاملModelling biochemical pathways through enhanced pi-calculus
We use the -calculus to model the evolution of biochemical systems, taking advantage of their similarities with global computation applications. First, we present a reduction semantics for the -calculus from which causality and concurrency can be mechanically derived. We prove that our semantics agrees with the causal de-nitions presented in the literature. We also extend our semantics to model...
متن کامل